A Proximal Algorithm with Quasi Distance. Application to Habit’s Formation
نویسندگان
چکیده
We consider a proximal algorithm with quasi distance applied to nonconvex and nonsmooth functions involving analytic properties for an unconstrained minimization problem. We show the behavioral importance of this proximal point model for habit’s formation in Decision and Making Sciences.
منابع مشابه
Generalized Inexact Proximal Algorithms: Habit’s/ Routine’s Formation with Resistance to Change, following Worthwhile Changes
This paper shows how, in a quasi metric space, an inexact proximal algorithm with a generalized perturbation term appears to be a nice tool for Behavioral Sciences (Psychology, Economics, Management, Game theory,. . . ). More precisely, the new perturbation term represents an index of resistance to change, defined as a “curved enough” function of the quasi distance between two successive iterat...
متن کاملGeneralized Inexact Proximal Algorithms: Routine's Formation with Resistance to Change, Following Worthwhile Changes
This paper shows how, in a quasi metric space, an inexact proximal algorithm with a generalized perturbation term appears to be a nice tool for Behavioral Sciences (Psychology, Economics, Management, Game theory,. . . ). More precisely, the new perturbation term represents an index of resistance to change, defined as a “curved enough” function of the quasi distance between two successive iterat...
متن کاملA Generalized Proximal Linearized Algorithm for Dc Functions with Application to the Optimal Size of the Firm Problem
A proximal linearized algorithm with a quasi distance as regularization term for minimizing a DC function (difference of two convex functions) is proposed. If the sequence generated by our algorithm is bounded, it is proved that every cluster point is a critical point of the function under consideration, even if minimizations are performed inexactly at each iteration. A sufficient condition for...
متن کاملA Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملProximal-like algorithm using the quasi D-function for convex second-order cone programming
In this paper, we present a measure of distance in second-order cone based on a class of continuously differentiable strictly convex function on IR++. Since the distance function has some favorable properties similar to those of D-function [8], we here refer it as a quasi D-function. Then, a proximal-like algorithm using the quasi D-function is proposed and applied to the second-cone programmin...
متن کامل